Information spreading on dynamic social networks
نویسندگان
چکیده
منابع مشابه
Information spreading on dynamic social networks
Nowadays, information spreading on social networks has triggered an explosive attention in various disciplines. Most of previous works in this area mainly focus on discussing the effects of spreading probability or immunization strategy on static networks. However, in real systems, the peer-to-peer network structure changes constantly according to frequently social activities of users. In order...
متن کاملInformation Spreading in Dynamic Networks
We study the fundamental problem of information spreading (also known as gossip) in dynamic networks. In gossip, or more generally, k-gossip, there are k pieces of information (or tokens) that are initially present in some nodes and the problem is to disseminate the k tokens to all nodes. The goal is to accomplish the task in as few rounds of distributed computation as possible. The problem is ...
متن کاملCharacterizing Information Spreading in Online Social Networks
Online social networks (OSNs) are changing the way in which the information spreads throughout the Internet. A deep understanding of the information spreading in OSNs leads to both social and commercial benefits. In this paper, we characterize the dynamic of information spreading (e.g., how fast and widely the information spreads against time) in OSNs by developing a general and accurate model ...
متن کاملImpact of Repeated Exposures on Information Spreading in Social Networks
Clustered structure of social networks provides the chances of repeated exposures to carriers with similar information. It is commonly believed that the impact of repeated exposures on the spreading of information is nontrivial. Does this effect increase the probability that an individual forwards a message in social networks? If so, to what extent does this effect influence people's decisions ...
متن کاملOn the Complexity of Information Spreading in Dynamic Networks
We study how to spread k tokens of information to every node on an n-node dynamic network, the edges of which are changing at each round. This basic gossip problem can be completed in O(n+k) rounds in any static network, and determining its complexity in dynamic networks is central to understanding the algorithmic limits and capabilities of various dynamic network models. Our focus is on token-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications in Nonlinear Science and Numerical Simulation
سال: 2014
ISSN: 1007-5704
DOI: 10.1016/j.cnsns.2013.08.028